-
1 unconstrained optimization
мат. безусловная оптимизация (задача нахождения экстремума функции в отсутствие каких-л. ограничений; исследование этой задачи является полезным, так как часто к ней можно свести задачу условной оптимизации; для безусловной оптимизации необходимо выполнение условий второго порядка)See:Англо-русский экономический словарь > unconstrained optimization
-
2 unconstrained optimization
Большой англо-русский и русско-английский словарь > unconstrained optimization
-
3 unconstrained optimization
1) Экономика: безусловная оптимизация2) Макаров: оптимизация без ограниченийУниверсальный англо-русский словарь > unconstrained optimization
-
4 unconstrained optimization
English-Russian dictionary of computer science and programming > unconstrained optimization
-
5 unconstrained optimization
Англо-русский словарь по экономике и финансам > unconstrained optimization
-
6 unconstrained optimization
Англо-русский словарь по машиностроению > unconstrained optimization
-
7 unconstrained optimization
English-Russian scientific dictionary > unconstrained optimization
-
8 unconstrained optimization
оптимизация без ограничений, безусловная оптимизация -
9 unconstrained optimization
The English-Russian dictionary on reliability and quality control > unconstrained optimization
-
10 optimization
-
11 optimization
aerodynamic optimizationaeroelastic optimizationconstrained optimizationcruise-dash optimizationdesign optimizationdistributed-parameter optimizationdual-performance optimizationeigenvalue optimizationfixed-time optimizationflutter optimizationgradient projection optimizationgradient-based optimizationLagrange optimizationlinear quadratic optimizationmaneuver optimizationminimum mass optimizationmultidiscipline optimizationmultiobjective optimizationone-dimensional optimizationshape optimizationsteepest descents optimizationstrength-flutter optimizationstructural optimizationstructure optimizationstructure/control optimizationtime-domain optimizationtrajectory optimizationtrim optimizationtwo variable optimizationunconstrained optimizationwing optimization -
12 optimization
- compiler optimization
- constrained optimization
- hand optimization
- linear optimization
- local optimization
- loop optimization
- machine-dependent optimization
- machine-independent optimization
- multiobjective optimization
- nondifferential optimization
- nonlinear optimization
- on-line process optimization
- overall optimization
- parameter optimization
- peephole optimization
- postroute optimization
- semi-infinite optimization
- sequential optimization
- unconstrained optimization
- vector optimizationEnglish-Russian dictionary of computer science and programming > optimization
-
13 optimization
1) оптимизация (напр. процесса)2) определение оптимальных характеристик, подбор оптимальных условийАнгло-русский словарь по экономике и финансам > optimization
-
14 constrained optimization
иссл. опер. условная оптимизация (поиск оптимального решения при наличии ограничений на значения переменных; в такой задаче для нахождения оптимума часто достаточно условий первого порядка)See:Англо-русский экономический словарь > constrained optimization
-
15 безусловная оптимизация
Большой англо-русский и русско-английский словарь > безусловная оптимизация
-
16 first-order conditions
мат. условия первого порядка, необходимые условия (в задаче оптимизации: равенство нулю первой производной функции; всегда является необходимым условием наличия оптимума, но достаточным условием является только в задаче условной оптимизации)See:Англо-русский экономический словарь > first-order conditions
-
17 second-order conditions
мат. условия второго порядка, достаточные условия (в задаче оптимизации: равенство нулю второй производной функции; является достаточным условием наличия оптимума в задаче безусловной оптимизации)See:Англо-русский экономический словарь > second-order conditions
-
18 algorithm
- ad hoc algorithm
- adaptive algorithm
- aim algorithm
- algorithm for path connections
- automatic assessment algorithm
- back-propagation algorithm
- banker's algorithm
- best-route algorithm
- bicomponent algorithm
- bipartitioning algorithm
- bisection algorithm
- branch-bound algorithm
- branching algorithm
- cascading algorithm
- chain algorithm
- channel router algorithm
- coarse-to-fine algorithm
- column sweep algorithm
- combinatorial algorithm
- computational algorithm
- computing algorithm
- conservative algorithm
- control algorithm
- convergent algorithm
- curve-fitting algorithm
- cutting-plane algorithm
- D-algorithm
- decision algorithm
- decoding algorithm
- demand-paging algorithm
- deterministic algorithm
- digit-by-digit algorithm
- divide-and-conquer algorithm
- double-sweep algorithm
- draphics algorithm
- drawing algorithm
- DSP algorithm
- dual algorithm
- durable algorithm
- earliest-deadline-first algorithm
- edge-based algorithm
- event-scheduling algorithm
- exchange algorithm
- fault-handling algorithm
- fine-to-coarse algorithm
- fixed-stealing algorithm
- fixed-step-size algorithm
- flow-synthesis algorithm
- forward-looking algorithm
- generalized algorithm
- genetic algorithm
- Goto algorithm
- graph algorithm
- graph traversal algorithm
- greedy algorithm
- grid expansion algorithm
- hardware algorithm
- heuristic algorithm
- Hightower algorithm
- incorrect algorithm
- inference-based algorithm
- inferencing algorithm
- instruction issue algorithm
- integer algorithm
- integrated query optimization algorithm
- iteration algorithm
- iterative algorithm
- layout algorithm
- layout copmaction algorithm
- leaky bucket algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-expansion algorithm
- Lee-type algorithm
- levelization algorithm
- linear expansion algorithm
- line-placing algorithm
- line-probe algorithm
- logical algorithm
- mathematically based algorithm
- mathematically intensive algorithm
- maximum matching algorithm
- mesh algorithm - minimum path-length algorithm
- modeling algorithm
- multikey algorithm
- multipass algorithm
- nested algorithm
- network algorithm
- normal algorithm
- no-wait algorithm
- operative algorithm
- optimal assignment algorithm
- optimal cutting algorithm
- ordering algorithm
- page-replacement algorithm
- paging algorithm
- parallel algorithm
- partitioning algorithm
- path-tracing algorithm
- pipeline algorithm
- pitch algorithm
- placement algorithm
- prediction algorithm
- primal-dual algorithm
- primary algorithm
- problem algorithm
- procrastination algorithm
- public-key algorithm
- quorum-based algorithm
- random search algorithm
- recognition algorithm
- recursive algorithm
- relaxation algorithm
- replicate algorithm
- robust algorithm
- round-robin algorithm
- routing algorithm
- scanline algorithm
- scheduling algorithm
- sequential algorithm
- shortest path algorithm
- shrinking algorithm
- simplex algorithm
- simulated annealing algorithm
- software algorithm
- spanning tree algorithm
- speech generation algorithm
- speed-enhancing algorithm
- square rooting algorithm
- steepest ascent algorithm
- systolic algorithm
- testing algorithm
- text-to-speech algorithm
- threshold decoding algorithm
- timetable scheduling algorithm
- trace back algorithm
- translation algorithm
- transportation algorithm
- tree-search algorithm
- two-dimensional placement algorithm
- two-list algorithm
- type-inferencing algorithm
- unconstrained minimization algorithm
- universal algorithm
- variable-stealing algorithm
- Vintr algorithm
- VLSI algorithm
- write-back algorithmEnglish-Russian dictionary of computer science and programming > algorithm
-
19 technique
1) техника (совокупность приёмов); методика; метод, способ; процедура2) технология -
20 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem
- 1
- 2
См. также в других словарях:
Optimization (mathematics) — In mathematics, the term optimization, or mathematical programming, refers to the study of problems in which one seeks to minimize or maximize a real function by systematically choosing the values of real or integer variables from within an… … Wikipedia
optimization — /op teuh meuh zay sheuhn/ 1. the fact of optimizing; making the best of anything. 2. the condition of being optimized. 3. Math. a mathematical technique for finding a maximum or minimum value of a function of several variables subject to a set of … Universalium
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
Multidisciplinary design optimization — Multi disciplinary design optimization (MDO) is a field of engineering that uses optimization methods to solve design problems incorporating a number of disciplines. As defined by Prof. Carlo Poloni, MDO is the art of finding the best compromise … Wikipedia
Combinatorial optimization — In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.[1] In many such problems, exhaustive search is not feasible. It operates on… … Wikipedia
Shape optimization — is part of the field of optimal control theory. The typical problem is to find the shape which is optimal in that it minimizes a certain cost functional while satisfying given constraints. In many cases, the functional being solved depends on the … Wikipedia
Convex optimization — Convex minimization, a subfield of optimization, studies the problem of minimizing convex functions over convex sets. Given a real vector space X together with a convex, real valued function defined on a convex subset of X, the problem is to find … Wikipedia
Newton's method in optimization — A comparison of gradient descent (green) and Newton s method (red) for minimizing a function (with small step sizes). Newton s method uses curvature information to take a more direct route. In mathematics, Newton s method is an iterative method… … Wikipedia
Lagrange multiplier — Figure 1: Find x and y to maximize f(x,y) subject to a constraint (shown in red) g(x,y) = c … Wikipedia
Cuckoo search — (CS) is an optimization algorithm developed by Xin she Yang and Suash Deb in 2009.[1][2] It was inspired by the obligate brood parasitism of some cuckoo species by laying their eggs in the nests of other host birds (of other species). Some host… … Wikipedia
CUTEr — A Constrained and Unconstrained Testing Environment, revisited = CUTEr [2] is an [http://www.opensource.org open source] testing environment for optimization and linear algebra solvers which provides a collection of test problems along with a set … Wikipedia